package seiacpjava_a2.datastructures.tree;

public class TreeNode {
	private int item;
	private TreeNode left;
	private TreeNode right;

	public TreeNode() {
	}

	public TreeNode(int item, TreeNode left, TreeNode right) {
		this.item = item;
		this.left = left;
		this.right = right;
	}

	public int getItem() {
		return item;
	}

	public void setItem(int item) {
		this.item = item;
	}

	public TreeNode getLeft() {
		return left;
	}

	public void setLeft(TreeNode left) {
		this.left = left;
	}

	public TreeNode getRight() {
		return right;
	}

	public void setRight(TreeNode right) {
		this.right = right;
	}
}